package src.leetcode.dp.medium_0092;

public class numTrees {
    public static void main(String[] args) {
        Solution solution = new Solution();
        System.out.println(solution.numTrees(3));
    }
}


class Solution {
    public int numTrees(int n) {
        int []dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;

        for (int i = 2; i <= n; i++) {
            for(int j = i - 1; j >= 0; j--) {
                dp[i] += dp[j] * dp[i - j - 1];
            }
        }

        return dp[n];
    }
}